Deterministic Hardness Amplification via Local GMD Decoding
نویسندگان
چکیده
We study the average-case hardness of the class NP against deterministic polynomial time algorithms. We prove that there exists some constant μ > 0 such that if there is some language in NP for which no deterministic polynomial time algorithm can decide L correctly on a 1 − (log n)−μ fraction of inputs of length n, then there is a language L′ in NP for which no deterministic polynomial time algorithm can decide L′ correctly on a 3/4+(log n)−μ fraction of inputs of length n. In coding theoretic terms, we give a construction of a monotone code that can be uniquely decoded up to error rate 14 by a deterministic local decoder.
منابع مشابه
Uniform Hardness Amplification in NP via Monotone Codes
We consider the problem of amplifying uniform average-case hardness of languages in NP, where hardness is with respect to BPP algorithms. We introduce the notion of monotone errorcorrecting codes, and show that hardness amplification for NP is essentially equivalent to constructing efficiently locally encodable and locally list-decodable monotone codes. The previous hardness amplification resul...
متن کاملApproximate List-Decoding of Direct Product Codes and Uniform Hardness Amplification
Given a message msg ∈ {0, 1}N , its k-wise direct product encoding is the sequence of k-tuples (msg(i1), . . . ,msg(ik)) over all possible k-tuples of indices (i1, . . . , ik) ∈ {1, . . . , N}k. We give an efficient randomized algorithm for approximate local list-decoding of direct product codes. That is, given oracle access to a word which agrees with a k-wise direct product encoding of some m...
متن کاملReduced GMD decoding
A framework is presented for generalized minimum distance (GMD) decoding with a limited number of decoding trials and a restricted set of reliability values. In GMD decoding, symbols received from the channel may be erased before being fed into an algebraic error-erasure decoder for error correction, in subsequent or simultaneous trials with different erasing patterns. The decision whether or n...
متن کاملA multicast hybrid ARQ scheme using MDS codes and GMD decoding
| An e cient multicast hybrid ARQ scheme is proposed by incorporating the generalized minimum distance (GMD) decoding of maximum distance separable (MDS) codes with Metzner's scheme [8]. Erroneous frames are stored in the receiver bu er and recovered after receiving one or more redundant frames. The throughput and the average transmission delay of the proposed scheme are analyzed on memoryless ...
متن کاملOptimal thresholds for GMD decoding with ℓ+1 over ℓ-extended Bounded Distance decoders
We investigate threshold–based multi–trial decoding of concatenated codes with an inner Maximum–Likelihood decoder and an outer error/erasure l+1 l –extended Bounded Distance decoder, i.e. a decoder which corrects ε errors and τ erasures if l+1 l ε+τ ≤ d−1, where d is the minimum distance of the outer code and l ∈ N\{0}. This is a generalization of Forney’s GMD decoding, which was considered on...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Electronic Colloquium on Computational Complexity (ECCC)
دوره 14 شماره
صفحات -
تاریخ انتشار 2007